Cbs Constants for Graph-laplacians and Application to Multilevel Methods for Discontinuous Galerkin Systems

نویسنده

  • R. LAZAROV
چکیده

The goal of this work is to derive and justify a multilevel preconditioner for symmetric discontinuous approximations of second order elliptic problems. Our approach is based on the following simple idea. The finite element space V of piece-wise polynomials of certain degree that are discontinuous on the partition T0 is projected onto the space of piece-wise constants on the same partition. This will constitute the finest space in the multilevel method. The projection of the discontinuous Galerkin system on this space is associated to the so-called “graph-Laplacian”. In 2-D this is a very simple M-matrix with −1 as off diagonal entries and current diagonal entries equal to the number of the neighbours through the interfaces of the current finite element. Then after consecutive aggregation of the finite elements we produce a sequence of spaces of piece-wise constant functions. We develop the concept of hierarchical splitting of the unknowns and using local analysis we derive uniform estimates for the constant in the strengthen Cauchy-BunyakowskiSchwarz (CBS) inequality. As a measure of the angle between the spaces of the splitting, this further is used to justify a multilevel preconditioner of the discontinuous Galerkin system in spirit of the work [4] of Axelsson and Vassilevski. key words: discontinuous Galerkin, second order elliptic equation, graph-Laplacian, multilevel preconditioning, CBS constant

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CBS constants for multilevel splitting of graph-Laplacian and application to preconditioning of discontinuous Galerkin systems

The goal of this work is to derive and justify a multilevel preconditioner of optimal arithmetic complexity for symmetric interior penalty discontinuous Galerkin finite element approximations of second order elliptic problems. Our approach is based on the following simple idea given in [R.D. Lazarov, P.S. Vassilevski, L.T. Zikatanov, Multilevel preconditioning of second order elliptic discontin...

متن کامل

On the robustness of hierarchical multilevel splittings for discontinuous Galerkin rotated bilinear FE problems

In this paper we present a new framework for multilevel preconditioning of large sparse systems of linear algebraic equations arising from the interior penalty discontinuous Galerkin approximation of second-order elliptic boundary value problems. Though the focus is on a particular family of rotated bilinear non-conforming (Rannacher-Turek) finite elements in two space dimensions (2D) the propo...

متن کامل

Algebraic Multigrid Preconditioning of High-Order Spectral Elements for Elliptic Problems on a Simplicial Mesh

Algebraic multigrid is investigated as a solver for linear systems that arise from high-order spectral element discretizations. An algorithm is introduced that utilizes the efficiency of low-order finite elements to precondition the high-order method in a multilevel setting. In particular, the efficacy of this approach is highlighted on simplexes in two and three dimensions with nodal spectral ...

متن کامل

hp-Multigrid as Smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows: Part I. Multilevel analysis

The hp-Multigrid as Smoother algorithm (hp-MGS) for the solution of higher order accurate space–time discontinuous Galerkin discretizations of advection dominated flows is presented. This algorithm combines p-multigrid with h-multigrid at all p-levels, where the h-multigrid acts as smoother in the p-multigrid. The performance of the hp-MGS algorithm is further improved using semi-coarsening in ...

متن کامل

Constructively well-posed approximation methods with unity inf-sup and continuity constants for partial differential equations

Starting from the generalized Lax-Milgram theorem and from the fact that the approximation error is minimized when the continuity and inf– sup constants are unity, we develop a theory that provably delivers well-posed approximation methods with unity continuity and inf–sup constants for numerical solution of linear partial differential equations. We demonstrate our single-framework theory on sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006